ATLS - A parallel loop scheduling scheme for dynamic environments
نویسندگان
چکیده
We here present ATLS, a self scheduling scheme designed for execution of parallel loops in dynamic environments of non-dedicated networked computers. Since grid and volunteer systems based on desktop computers are proving themselves as real and powerful alternatives for parallel computing, new scheduling schemes, better suited for these environments, are required. Our proposal, by tracking several performance change ratios at runtime, is able to properly adjust the load distribution using no prior information of the loop features nor the involved processors. The results obtained during the experiments performed to validate ATLS show that it is possible to improve former contributions of well-known parallel loop scheduling schemes in dynamic environments. The implementation of the scheduler has been done for the R language but, as it is exposed, it can easily be adapted to any other language and parallel loop based application.
منابع مشابه
Solving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملA New Communication and Computation Overlapping Model with Loop Sub-Partitioning and Dynamic Scheduling
The latency hiding techniques can significantly improve the performance of the parallel programs in distributed memory systems. This paper presents a communication and computation overlapping model to hide the communication latency in data parallel programs. The communication and computation overlapping model makes use of the loop subpartitioning scheme in which a given loop partition is partit...
متن کاملA More Practical Loop Scheduling Scheme for Home-based Software DSMs
Loop scheduling is a critical issue for achieving good performance in parallel and distributed systems. However, this issue is neglected in the area of software DSM systems in the past. All the previous research is based on dedicated homogeneous hardware environment, such as shared memory multiprocessors, and hardware distributed shared memory systems. The main contribution of this paper is two...
متن کاملEmploying a study of the robustness metrics to assess the reliability of dynamic loop scheduling ∗
To achieve best performance, scientific applications are executed on parallel and distributed heterogeneous computing systems. These applications often are computationally intensive, data parallel, irregular, and usually contain large loops that exhibit non-uniform characteristics depending upon their semantic structure during execution. These loops are the most data parallel and computationall...
متن کامل